Can Context Sequence Matching Be Used for XML Querying?
نویسندگان
چکیده
We describe a matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. The algorithm is called a context sequence matching algorithm. Context variables allow matching to descend in term-trees to arbitrary depth. Sequence variables allow matching to move in term-trees in arbitrary breadth. The ability to explore terms in two orthogonal directions in a uniform way may be useful for querying data available as a large term, like XML documents. We extend the algorithm to process regular constraints and discuss its possible application in XML querying.
منابع مشابه
Querying XML documents with multi-dimensional markup
XML documents annotated by different NLP tools accommodate multidimensional markup in a single hierarchy. To query such documents one has to account for different possible nesting structures of the annotations and the original markup of a document. We propose an expressive pattern language with extended semantics of the sequence pattern, supporting negation, permutation and regular patterns tha...
متن کاملOn the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. In this paper, we address the problem of query equivalence with respect to this transformation, and we introduce a performance-oriented principle for sequencing tree stru...
متن کاملFuzzy Querying of Semi-structured Data
Querying XML data is a well-explored topic thanks to powerful query languages such as XPath and XQuery. Both were designed to support the evaluation of binary predicates, which can be proven to be a limited approach to effective querying of XML data. In this paper, a fuzzy extension of the XPath query language is proposed. Its goal is to achieve more flexible querying through vague queries, whi...
متن کاملContext Sequence Matching for XML
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-based language to query and transform XML, or to specify and verify web sites. Such a language would have advantages of both path-based and pattern-based languages. We develop a context sequence matching algorithm and ...
متن کاملGXQuery: Extending XQuery for Querying Graph-structured XML Data
XML data can be naturally modeled as a graph. Existing query languages to XML can only express queries of matching XML document with a tree-structured schema with structural and value constraints without the consideration of graph features. The ability of such query languages cannot satisfy various requirements of querying graph-structured XML data. In this paper, GXQuery is presented as an ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005